A Finite Model Property for Intersection Types
نویسندگان
چکیده
منابع مشابه
A Finite Model Property for Intersection Types
We show that the relational theory of intersection types known as BCD has the finite model property; that is, BCD is complete for its finite models. Our proof uses rewriting techniques which have as an immediate by-product the polynomial time decidability of the preorder ⊆ (although this also follows from the so called beta soundness of BCD). BCD is the relational theory of intersection types p...
متن کاملFinite Combinatory Logic with Intersection Types
Combinatory logic is based on modus ponens and a schematic (polymorphic) interpretation of axioms. In this paper we propose to consider expressive combinatory logics under the restriction that axioms are not interpreted schematically but ,,literally”, corresponding to a monomorphic interpretation of types. We thereby arrive at finite combinatory logic, which is strictly finitely axiomatisable a...
متن کاملThe finite representation property for composition, intersection, domain and range
We prove that the finite representation property holds for representation by partial functions for the signature consisting of composition, intersection, antidomain and range. It follows that the finite representation property holds for any expansion of this signature with the fixset, preferential union, maximum iterate and opposite operators. The proof shows that for all these signatures the s...
متن کاملModules with copure intersection property
In this paper, we investigate the modules with the copure intersection property and obtained obtain some related results.
متن کاملIntersection Types for -Trees
We introduce a type assignment system which is parametric with respect to ve families of trees obtained by evaluating -terms (Bohm trees, L evy-Longo trees, ...). Then we prove, in an (almost) uniform way, that each type assignment system fully describes the observational equivalences induced by the corresponding tree representation of terms. More precisely, for each family of trees, two terms...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2015
ISSN: 2075-2180
DOI: 10.4204/eptcs.177.1